An Optimal Code Heuristic Approach for Compiler Optimization using Graph Coloring Technique
نویسندگان
چکیده
منابع مشابه
A Heuristic Approach for Graph Coloring Using Combinatorics
Despite the variety of solutions suggested for the graph coloring problems till today, the classical graph coloring problem remains unsolved as it is NP – Complete. This intricacy naturally led to the development of a wide range of sub-optimal solutions. The speed of computing a sub – optimal solution, measured through its computational complexity, is obviously one of the most important criteri...
متن کاملOptimal Allocation of TCSC Using Heuristic Optimization Technique
With the massive increase in the population and, as a result of the expansion of the power grid, new problems such as loss power in network retaliation were created. So studies on this issue began. These studies led to the emergence of FACTs devices. The Flexible AC transmission System (FACTS) devices, such as, thyristor controlled series compensators (TCSC) may be used to enhance system perfor...
متن کاملA Parallel Graph Coloring Heuristic
The problem of computing good graph colorings arises in many diverse applications , such as in the estimation of sparse Jacobians and in the development of eecient, parallel iterative methods for solving sparse linear systems. In this paper we present an asynchronous graph coloring heuristic well suited to distributed memory parallel computers. We present experimental results obtained on an Int...
متن کاملA Range-Compaction Heuristic for Graph Coloring
This paper presents a novel heuristic for graph coloring that works on a range of colors and iteratively tries to make this range more compact. This range-compaction heuristic also has a \pressure" component and an annealing schedule for it. The value of this component is empirically quanti ed. This algorithm is evaluated on a wide range of DIMACS benchmark graphs, and found to be competitive w...
متن کاملStatistical Heuristic Selection for Graph Coloring
of the Thesis Statistical Heuristic Selection for Graph Coloring
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/13708-1461